0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.14 % Command : run_E %s %d THM 0.14/0.35 % Computer : n015.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 960 0.14/0.35 % WCLimit : 120 0.14/0.35 % DateTime : Tue Aug 9 05:52:41 EDT 2022 0.14/0.35 % CPUTime : 0.20/0.49 Running higher-order on 8 cores theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.49 # Version: 3.0pre003-ho 0.20/0.50 # Preprocessing class: HSSSSMSSSLSNHHA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.50 # Starting sh3l with 120s (1) cores 0.20/0.50 # Starting lpo6_lambda_fix with 120s (1) cores 0.20/0.50 # Starting full_lambda_8 with 120s (1) cores 0.20/0.50 # full_lambda_8 with pid 17713 completed with status 0 0.20/0.50 # Result found by full_lambda_8 0.20/0.50 # Preprocessing class: HSSSSMSSSLSNHHA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.50 # Starting sh3l with 120s (1) cores 0.20/0.50 # Starting lpo6_lambda_fix with 120s (1) cores 0.20/0.50 # Starting full_lambda_8 with 120s (1) cores 0.20/0.50 # No SInE strategy applied 0.20/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN 0.20/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.50 # Starting ho_unfolding_3 with 54s (1) cores 0.20/0.50 # ho_unfolding_3 with pid 17714 completed with status 0 0.20/0.50 # Result found by ho_unfolding_3 0.20/0.50 # Preprocessing class: HSSSSMSSSLSNHHA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.50 # Starting sh3l with 120s (1) cores 0.20/0.50 # Starting lpo6_lambda_fix with 120s (1) cores 0.20/0.50 # Starting full_lambda_8 with 120s (1) cores 0.20/0.50 # No SInE strategy applied 0.20/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN 0.20/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.50 # Starting ho_unfolding_3 with 54s (1) cores 0.20/0.50 # Preprocessing time : 0.001 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 thf(decl_22, type, cNAT: (($i > $o) > $o) > $o). 0.20/0.50 thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o). 0.20/0.50 thf(decl_24, type, cZERO: ($i > $o) > $o). 0.20/0.50 thf(decl_25, type, epred1_0: (($i > $o) > $o) > $o). 0.20/0.50 thf(decl_26, type, epred2_0: ($i > $o) > $o). 0.20/0.50 thf(decl_27, type, epred3_1: ((($i > $o) > $o) > $o) > ($i > $o) > $o). 0.20/0.50 thf(decl_28, type, esk1_1: $i > $o). 0.20/0.50 thf(decl_29, type, esk2_0: $i). 0.20/0.50 thf(decl_30, type, esk3_1: $i > $o). 0.20/0.50 thf(decl_31, type, esk4_2: (($i > $o) > $o) > $i > $o). 0.20/0.50 thf(decl_32, type, esk5_1: (($i > $o) > $o) > $i). 0.20/0.50 thf(decl_33, type, esk6_1: (($i > $o) > $o) > $i). 0.20/0.50 thf(decl_34, type, esk7_1: $i > $o). 0.20/0.50 thf(decl_35, type, esk8_0: $i). 0.20/0.50 thf(decl_36, type, esk9_0: $i). 0.20/0.50 thf(decl_37, type, esk10_1: (($i > $o) > $o) > $i). 0.20/0.50 thf(decl_38, type, esk11_1: (($i > $o) > $o) > $i). 0.20/0.50 thf(cNAT_def, axiom, ((cNAT)=(^[X3:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ cZERO)&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (cSUCC @ X6)))))=>(X5 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cNAT_def)). 0.20/0.50 thf(cZERO_def, axiom, ((cZERO)=(^[X1:$i > $o]:(~(?[X2:$i]:((X1 @ X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cZERO_def)). 0.20/0.50 thf(cSUCC_def, axiom, ((cSUCC)=(^[X3:($i > $o) > $o, X1:$i > $o]:(?[X2:$i]:(((X1 @ X2)&(X3 @ (^[X4:$i]:((((X4)!=(X2))&(X1 @ X4)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cSUCC_def)). 0.20/0.50 thf(cINDUCTION, conjecture, ![X7:(($i > $o) > $o) > $o]:((((X7 @ cZERO)&![X8:($i > $o) > $o]:(((X7 @ (cSUCC @ X8))<=(X7 @ X8))))=>![X9:($i > $o) > $o]:(((X7 @ X9)<=(cNAT @ X9))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cINDUCTION)). 0.20/0.50 thf(c_0_4, plain, ((cNAT)=(^[Z0:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1:$i > $o]:(~(?[X13:$i]:((Z1 @ X13))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1:$i > $o]:(?[X14:$i]:(((Z1 @ X14)&(X6 @ (^[Z2:$i]:((((Z2)!=(X14))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(fof_simplification,[status(thm)],[cNAT_def])). 0.20/0.50 thf(c_0_5, plain, ((cZERO)=(^[Z0:$i > $o]:(~(?[X2:$i]:((Z0 @ X2)))))), inference(fof_simplification,[status(thm)],[cZERO_def])). 0.20/0.50 thf(c_0_6, plain, ((cSUCC)=(^[Z0:($i > $o) > $o, Z1:$i > $o]:(?[X2:$i]:(((Z1 @ X2)&(Z0 @ (^[Z2:$i]:((((Z2)!=(X2))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])). 0.20/0.50 thf(c_0_7, plain, ((cNAT)=(^[Z0:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1:$i > $o]:(~(?[X13:$i]:((Z1 @ X13))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1:$i > $o]:(?[X14:$i]:(((Z1 @ X14)&(X6 @ (^[Z2:$i]:((((Z2)!=(X14))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6])). 0.20/0.50 thf(c_0_8, negated_conjecture, ~(![X7:(($i > $o) > $o) > $o]:((((X7 @ (^[Z0:$i > $o]:(~(?[X15:$i]:((Z0 @ X15))))))&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (^[Z0:$i > $o]:(?[X16:$i]:(((Z0 @ X16)&(X8 @ (^[Z1:$i]:((((Z1)!=(X16))&(Z0 @ Z1)))))))))))))=>![X9:($i > $o) > $o]:((![X17:(($i > $o) > $o) > $o]:((((X17 @ (^[Z0:$i > $o]:(~(?[X18:$i]:((Z0 @ X18))))))&![X19:($i > $o) > $o]:(((X17 @ X19)=>(X17 @ (^[Z0:$i > $o]:(?[X20:$i]:(((Z0 @ X20)&(X19 @ (^[Z1:$i]:((((Z1)!=(X20))&(Z0 @ Z1)))))))))))))=>(X17 @ X9)))=>(X7 @ X9)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cINDUCTION]), c_0_5]), c_0_6]), c_0_7])])). 0.20/0.50 thf(c_0_9, negated_conjecture, ![X22:($i > $o) > $o, X24:(($i > $o) > $o) > $o]:((((epred1_0 @ (^[Z0:$i > $o]:(~(?[X15:$i]:((Z0 @ X15))))))&(~(epred1_0 @ X22)|(epred1_0 @ (^[Z0:$i > $o]:(?[X16:$i]:(((Z0 @ X16)&(X22 @ (^[Z1:$i]:((((Z1)!=(X16))&(Z0 @ Z1))))))))))))&((((X24 @ (epred3_1 @ X24))|~(X24 @ (^[Z0:$i > $o]:(~(?[X18:$i]:((Z0 @ X18))))))|(X24 @ epred2_0))&(~(X24 @ (^[Z0:$i > $o]:(?[X20:$i]:(((Z0 @ X20)&(epred3_1 @ X24 @ (^[Z1:$i]:((((Z1)!=(X20))&(Z0 @ Z1))))))))))|~(X24 @ (^[Z0:$i > $o]:(~(?[X18:$i]:((Z0 @ X18))))))|(X24 @ epred2_0)))&~(epred1_0 @ epred2_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])). 0.20/0.50 thf(c_0_10, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ (epred3_1 @ X5))|(X5 @ epred2_0)|~((X5 @ (^[Z0:$i > $o]:(~(?[X37:$i]:((Z0 @ X37))))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.50 thf(c_0_11, negated_conjecture, (epred1_0 @ (^[Z0:$i > $o]:(~(?[X38:$i]:((Z0 @ X38)))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.50 thf(c_0_12, negated_conjecture, ~((epred1_0 @ epred2_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.50 thf(c_0_13, negated_conjecture, ![X3:($i > $o) > $o]:(((epred1_0 @ (^[Z0:$i > $o]:(?[X39:$i]:(((Z0 @ X39)&(X3 @ (^[Z1:$i]:((((Z1)!=(X39))&(Z0 @ Z1))))))))))|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.50 thf(c_0_14, negated_conjecture, (epred1_0 @ (epred3_1 @ epred1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])). 0.20/0.50 thf(c_0_15, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ epred2_0)|~((X5 @ (^[Z0:$i > $o]:(?[X40:$i]:(((Z0 @ X40)&(epred3_1 @ X5 @ (^[Z1:$i]:((((Z1)!=(X40))&(Z0 @ Z1)))))))))))|~((X5 @ (^[Z0:$i > $o]:(~(?[X41:$i]:((Z0 @ X41))))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.50 thf(c_0_16, negated_conjecture, (epred1_0 @ (^[Z0:$i > $o]:(?[X42:$i]:(((Z0 @ X42)&(epred3_1 @ epred1_0 @ (^[Z1:$i]:((((Z1)!=(X42))&(Z0 @ Z1)))))))))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.20/0.50 thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_11])]), c_0_12]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Parsed axioms : 7 0.20/0.50 # Removed by relevancy pruning/SinE : 0 0.20/0.50 # Initial clauses : 8 0.20/0.50 # Removed in clause preprocessing : 3 0.20/0.50 # Initial clauses in saturation : 5 0.20/0.50 # Processed clauses : 50 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 3 0.20/0.50 # ...remaining for further processing : 47 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 0 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 60 0.20/0.50 # ...of the previous two non-redundant : 53 0.20/0.50 # ...aggressively subsumed : 0 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 18 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 9 0.20/0.50 # Equation resolutions : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 34 0.20/0.50 # Positive orientable unit clauses : 4 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 4 0.20/0.50 # Non-unit-clauses : 26 0.20/0.50 # Current number of unprocessed clauses: 13 0.20/0.50 # ...number of literals in the above : 43 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 13 0.20/0.50 # Clause-clause subsumption calls (NU) : 118 0.20/0.50 # Rec. Clause-clause subsumption calls : 70 0.20/0.50 # Non-unit clause-clause subsumptions : 4 0.20/0.50 # Unit Clause-clause subsumption calls : 1 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 1 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 50 0.20/0.50 # Condensation successes : 1 0.20/0.50 # Termbank termtop insertions : 5311 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.007 s 0.20/0.50 # System time : 0.001 s 0.20/0.50 # Total time : 0.008 s 0.20/0.50 # Maximum resident set size: 1844 pages 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.008 s 0.20/0.50 # System time : 0.004 s 0.20/0.50 # Total time : 0.011 s 0.20/0.50 # Maximum resident set size: 1736 pages 0.20/0.50 EOF